Model equivalence of PRISM programs
نویسنده
چکیده
The problem of deciding the probability model equivalence of two PRISM programs is addressed. In the finite case this problem can be solved (albeit slowly) using techniques from algebraic statistics, specifically the computation of elimination ideals and Gröbner bases. A very brief introduction to algebraic statistics is given. Consideration is given to cases where shortcuts to proving/disproving model equivalence are available.
منابع مشابه
Model-Theoretic Expressivity Analysis
In the preceding chapter the problem of comparing languages was considered from a behavioral perspective. In this chapter we develop an alternative, modeltheoretic approach. In this approach we compare the expressiveness of probabilistic-logic (pl-) languages by considering the models that can be characterized in a language. Roughly speaking, one language L is at least as expressive as another ...
متن کاملLearning failure-free PRISM programs
First-order logic can be used to represent relations amongst objects. Probabilistic graphical models encode uncertainty over propositional data. Following the demand of combining the advantages of both representations, probabilistic logic programs provide the ability to encode uncertainty over relational data. PRISM is a probabilistic logic programming formalism based on the distribution semant...
متن کاملModeling Scienti c Theories as PRISM Programs
PRISM is a new type of symbolic-statistical modeling language which integrates logic programming and learning seamlessly 2 . It is designed for the symbolic-statistical modeling of complex phenomena such as genetics and economics where logical/social rules and uncertainty interact, thus expected to be a valuable tool for scienti c discovery. In this paper, we rst give a detailed account of PRIS...
متن کاملHOL Theorem Prover Case Study: Verifying Probabilistic Programs
The focus of this paper is the question: “How suited is the HOL theorem prover to the verification of probabilistic programs?” To answer this, we give a brief introduction to our model of probabilistic programs in HOL, and then compare this approach to other formal tools that have been used to verify probabilistic programs: the Prism model checker, the Coq theorem prover, and the B method.
متن کاملParameter Learning in PRISM Programs with Continuous Random Variables
Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya’s PRISM, Poole’s ICL, De Raedt et al’s ProbLog and Vennekens et al’s LPAD, combines statistical and logical knowledge representation and inference. Inference in these languages is based on enumerative construction of proofs over logic programs. Consequently, these languages permit very limited use of random variables with con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007